From Brouwerian Counter Examples to the Creating Subject

نویسنده

  • Dirk van Dalen
چکیده

The earliest doubts of the validity of the Principle of the Excluded Middle (PEM) can be found in Brouwer’s notes for his dissertation. The actual formulation had to wait for the “Unreliability of the logical principles” paper one year later. It is a curious fact that in the dissertation Brouwer shrugged off the PEM as obvious and ‘uninformative’. He denied it mathematical significance, because “a function is either differentiable or not differentiable says nothing; it expresses the same as the following: ‘If a function is not differentiable, then it is not differentiable.’ ”1 This formulation is all the more surprising as Brouwer rejected at the same time Hilbert’s dogma of the solvability of mathematical problems. Moreover, in the notebooks which he compiled for the dissertation, he explicitly noted that “tertii exclusi” does not always hold”.2 Whatever his reasons may have been for balking at this final step, within a year he clearly and decisively formulated his objections to PEM. He observed that “the question of validity of the principium tertii exclusi is equivalent to the question whether unsolvable mathematical problems can exist. There is not a shred of proof for the conviction, which has sometimes been put forward that there exist no unsolvable mathematical problems.”3 The paper ends with the first Brouwerian counterexamples, i.e. examples of mathematical statements which hold on the basis of PEM, but which cannot be considered as proved from a constructive point of view:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Brouwerian Model of the Run-Time Memory

The run-time memory of a program may be described with a directed graph in which nodes represent chunks of memory and edges represent references. We define a closed cluster induced by a node n, denoted as CC(n), as the largest set of nodes that are reachable from n but are unreachable from nodes outside the closed cluster. Based on closed clusters, there is a Brouwerian structure under the run-...

متن کامل

Incorporating Prior Information in Machine Learning by Creating Virtual Examples

One of the key problems in supervised learning is the insufficient size of the training set. The natural way for an intelligent learner to counter this problem and successfully generalize is to exploit prior information that may be available about the domain or that can be learned from prototypical examples. We discuss the notion of using prior knowledge by creating virtual examples and thereby...

متن کامل

Incorporating Prior Information in MachineLearning by Creating Virtual

One of the key problems in supervised learning is the insuucient size of the training set. The natural way for an intelligent learner to counter this problem and successfully generalize is to exploit prior information that may be available about the domain or that can be learned from prototypical examples. We discuss the notion of using prior knowledge by creating virtual examples and thereby e...

متن کامل

اتانازی و تفاوت بین فعل و ترک

Euthanasia has been the subject of much controversy during the last three decades. In ethics most philosophers divide it into active and passive euthanasia and consider the first option to be immoral. There are some thinkers, however, who deny any moral significance in such a distinction. Among them and perhaps the first in this arena is James Rachels who is followed by other thinkers like Jona...

متن کامل

Infinite Games from an Intuitionistic Point of View

In this paper, we consider determinacy in Brouwerian intuitionistic mathematics. We give some examples of games such that the character of this mathematical setting—the lack of the law of excluded middle and the adoption of continuity principle—makes the behavior of determinacy drastically different from that on the classical setting.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Studia Logica

دوره 62  شماره 

صفحات  -

تاریخ انتشار 1999